Перевод: с русского на все языки

со всех языков на русский

complete a set of

См. также в других словарях:

  • Complete (box set) — Infobox Album | Name = Complete Type = box Artist = News from Babel Released = 2006 Recorded = 1983–1986 Genre = Avant progressive rock Length = 1:10:35 Label = Recommended (UK) Producer = News from Babel Reviews = Last album = Letters Home… …   Wikipedia

  • Complete (News from Babel album) — Complete Box set by News from Babel Released 2006 …   Wikipedia

  • complete — [[t]kəmpli͟ːt[/t]] ♦ completes, completing, completed 1) ADJ: usu ADJ n (emphasis) You use complete to emphasize that something is as great in extent, degree, or amount as it possibly can be. The rebels had taken complete control... It shows a… …   English dictionary

  • set — {{Roman}}I.{{/Roman}} noun 1 group of similar things ADJECTIVE ▪ complete, entire, full, whole ▪ broad, comprehensive, huge, large …   Collocations dictionary

  • complete — com|plete1 W1S2 [kəmˈpli:t] adj [Date: 1300 1400; : Old French; Origin: complet, from Latin, past participle of complere to fill up , from com ( COM ) + plere to fill ] 1.) [usually before noun] used to emphasize that a quality or situation is as …   Dictionary of contemporary English

  • Complete (disambiguation) — To be complete is to be in the state of requiring nothing else to be added.Complete may also refer to:* Complete (album), a 2001 country album * Complete (box set), a 2006 avant progressive rock album * Complete (complexity), in mathematics *… …   Wikipedia

  • Set packing — is a classical NP complete problem in computational complexity theory and combinatorics, and was one of Karp s 21 NP complete problems. Suppose we have a finite set S and a list of subsets of S. Then, the set packing problem asks if some k… …   Wikipedia

  • Complete bipartite graph — A complete bipartite graph with m = 5 and n = 3 Vertices n + m Edges mn …   Wikipedia

  • Set splitting — is a logical NP Complete problem which is defined as follows::: Instance : A finite set S and a collection C of finite subsets of S ;:: Query : Can the elements of S be colored with two colors, say red and green, so that no set X ∈ C has all… …   Wikipedia

  • Complete coloring — of the Clebsch graph with 8 colors. Every pair of colors appears on at least one edge. No complete coloring with more colors exists: in any 9 coloring some color would appear only at one vertex, and there would not be enough neighboring vertices… …   Wikipedia

  • Complete Charlie Parker on Dial — Box set by Charlie Parker Released July 23, 1996 (1996 July 23) …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»